Forgetting the Time in Timed Process Algebra
نویسنده
چکیده
In this paper, we propose the notion of partial time abstraction for timed process algebras, which introduces the possibility to abstract away parts of the timing of system behaviour. Adding this notion leads to so-called partially timed process algebras and partially timed labelled transition systems. We describe these notions, and generalise timed branching bisimilarity to partially timed branching bisimilarity, allowing the comparison of systems with partial timing. Finally, with several examples and a case study, we demonstrate how partial time abstraction can be a useful modelling technique for timed models, which can lead to rigorous minimisations of state spaces.
منابع مشابه
Forgetting the Time in Timed Process Algebra Timeless Behaviour in a Timestamped World
In this paper, we propose the notion of partial time abstraction for timed process algebras, which introduces the possibility to abstract away parts of the timing of system behaviour. Adding this notion leads to so-called partially timed process algebras and partially timed labelled transition systems. We describe these notions, and generalise timed branching bisimilarity to partially timed bra...
متن کاملVerifying Performance Equivalence for Timed Basic Parallel Processes
We address the problem of deciding performance equivalence for a timed process algebra in which actions are urgent and durational, and where parallel components have independent local clocks. This process algebra can be seen as a timed extension of BPP, a process algebra giving rise to infinite-state processes. While bisimulation was known to be decidable for BPP with a non elementary complexit...
متن کاملCSP + Clocks: a Process Algebra for Timed Automata
We propose a real-time extension to the process algebra CSP. Inspired by timed automata, a very successful formalism for the specification and verification of real-time systems, we handle real time by means of clocks, i.e. real-valued variables that increase at the same rate as time. This differs from the conventional approach based on timed transitions. We give a discrete trace and failures se...
متن کاملA Process Algebra and Tools for the Speci cation and Analysis of Resource-Bound Real-Time System
There has been signiicant progress in the development of timed process algebra for the speciication and analysis of real-time systems in recent years. This chapter describes a timed process algebra, called ACSR, which supports synchronous timed actions and asynchronous instantaneous events. Timed actions model the usage of shared resources and the passage of time, whereas events allow synchroni...
متن کاملCompleteness of Timed mCRL
In [9], a straightforward extension of the process algebra μCRL was proposed to explicitly deal with time. The process algebra μCRL has been designed especially to deal with data in a process algebraic context. Using the features for data, only a minor extension of the language was needed to obtain a very expressive variant of time. But [9] contains syntax, operational semantics and axioms char...
متن کامل